Spectral characterization of †-shape trees

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Ela Spectral Characterization of †-shape Trees∗

Received by the editors on January 11, 2011. Accepted for publication on July 10, 2011. Handling Editor: Leslie Hogben. College of Mathematics and System Science, Xinjiang University, Urumqi, 830046, P.R. China ([email protected], [email protected], [email protected]). Supported by NFSC Grant No. 10961023. Electronic Journal of Linear Algebra ISSN 1081-3810 A publication of the Internati...

متن کامل

Electronic Spectral Line Shape of a Diatomic Molecule

The electronic absorption spectral line shape of a diatomic molecule with harmonic potential curves is calculated using the time correlation function formalism. Both the equilibrium shift and the frequency shift of the two linking electronic states ate taken into account. The spectrum is also calculated using the cumulated expansion which is related to the correlation function of the time-d...

متن کامل

electronic spectral line shape of a diatomic molecule

the electronic absorption spectral line shape of a diatomic molecule with harmonic potential curves is calculated using the time correlation function formalism. both the equilibrium shift and the frequency shift of the two linking electronic states ate taken into account. the spectrum is also calculated using the cumulated expansion which is related to the correlation function of the time-depen...

متن کامل

Spectral properties of trinomial trees

In this paper, we prove that the probability kernel of a random walk on a trinomial tree converges to the density of a Brownian motion with drift at the rate O(h), where h is the distance between the nodes of the tree. We also show that this convergence estimate is optimal in which the density of the random walk cannot converge at a faster rate. The proof is based on an application of spectral ...

متن کامل

Probabilistic Characterization of Decision Trees Probabilistic Characterization of Decision Trees

In this paper we use the methodology introduced in Dhurandhar and Dobra (2006) for analyzing the error of classifiers and the model selection measures, to analyze decision tree algorithms. The methodology consists of obtaining parametric expressions for the moments of the Generalization error (GE) for the classification model of interest, followed by plotting these expressions for interpritabil...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Electronic Journal of Linear Algebra

سال: 2011

ISSN: 1081-3810

DOI: 10.13001/1081-3810.1477